Supermartingale decomposition with a general index set

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Supermartingale Decomposition with a General Index Set

By Doob’s theorem, supermartingales indexed by the natural numbers decompose into the difference of a uniformly integrable martingale and an increasing process. The relative ease of working with increasing processes rather than supermartingales explains the prominent role of this result in stochastic analysis and in the theory of stochastic integration. Meyer [19] then proved that, under the us...

متن کامل

Maximizing General Set Functions by Submodular Decomposition

We present a branch and bound method for maximizing an arbitrary set function V : 2 θ → R . By decomposing θ as f-δ , where f is a submodular function and δ is the cut function of a (simple, undirected) graph G with vertex set V, our original problem is reduced to a sequence of submodular maximization problems. We characterize a class of submodular functions, which when maximized in the subprob...

متن کامل

Quasimartingales with a Linearly Ordered Index Set

We consider quasi-martingales indexed by a linearly order set. We show that such processes are isomorphic to a given class of (finitely additive) measures. From this result we easily derive the classical theorem of Stricker as well as the decompositions of Riesz, Rao and the supermartingale decomposition of Doob and Meyer.

متن کامل

A note on polyomino chains with extremum general sum-connectivity index

The general sum-connectivity index of a graph $G$ is defined as $chi_{alpha}(G)= sum_{uvin E(G)} (d_u + d_{v})^{alpha}$ where $d_{u}$ is degree of the vertex $uin V(G)$, $alpha$ is a real number different from $0$ and $uv$ is the edge connecting the vertices $u,v$. In this note, the problem of characterizing the graphs having extremum $chi_{alpha}$ values from a certain collection of polyomino ...

متن کامل

Accurate Computation of Periodic Regions’ Centers in the General M-Set with Integer Index Number

This paper presents two methods for accurately computing the periodic regions’ centers. One method fits for the general M-sets with integer index number, the other fits for the general Msets with negative integer index number. Both methods improve the precision of computation by transforming the polynomial equations which determine the periodic regions’ centers. We primarily discuss the general...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Stochastic Processes and their Applications

سال: 2010

ISSN: 0304-4149

DOI: 10.1016/j.spa.2010.03.014